Synthesis of ESI Equivalence Class Combinational Circuit

نویسندگان

  • Justin E. Harlow
  • Franc Brglez
چکیده

\Permission to make digital/hard copy of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for proot or commercial advantage , the copyright notice, the title of the publication and its date appear, and notice is given that copying is by permission of CBL. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior speciic permission and/or a fee." If you choose to cite this report, please add the following entry to your bibliography database: number = "1997-TR@CBL-07-Harlow", month = "Oct", year = "1997", note = "{Also available at Abstract { Despite more than a decade of experience with the use of standardized benchmark circuits, meaningful comparisons of EDA algorithms remain elusive. In this paper, we introduce an entirely new methodology for characterizing the performance of Binary Decision Diagram (BDD) software. Our method involves the synthesis of large equivalence classes of Entropy{Signature Invariant (ESI) circuits, based on a known reference circuit. We demonstrate that such classes induce controllable distributions of BDD algorithm performance, which provide the foundation for statistically signiicant comparison of diierent algorithms. Introduction The characterization and comparison of Design Automation algorithms has historically been based on the use of widely{ accepted sets of benchmark circuitss1, 2]. The use of standardized test cases creates an impression of generality and lack of bias in comparisons, but in fact, there is little generality in this process. The commonly used benchmark circuits do not represent a continuum of complexity, and in general, the benchmark sets have no invariant properties: each circuit is unique in size, function and architecture. Furthermore, since these circuits are widely available and thoroughly studied, it is likely that many current DA tools are, in eeect, \tuned" to run well on these circuits. The authors do not mean to suggest any deception or dishonesty. The mere use of a small sample of speciic, unrelated circuits as measures of performance inherently induces bias. In most other elds of science, comparisons between theories are routinely made by use of controlled experiments. Acceptance of results by the community is conditioned on demonstration that a theory is repeatable and statistically signiicant; publication is often denied in cases of minor or in-cremental advances. The eld of Electronic Design Automation , in sharp contrast to such rigor, does not have any process analogous to \clinical …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Logic synthesis preserving high-level specification

In this paper we develop a method of logic synthesis that preserves high-level structure of the circuit to be synthesized. This method is based on the fact that two combinational circuits implementing the same “high-level” specification can be efficiently checked for equivalence. Hence, logic transformations preserving a predefined specification can be made efficiently. We introduce the notion ...

متن کامل

Structure-Driven Equivalence Verification for Circuits Optimized by Retiming and Combinational Synthesis

Sequential optimization techniques fall in two broad categories: state-based and structure-based [4]. Structurebased techniques optimize a circuit netlist by interleaving retiming and combinational synthesis in different ways to improve design metrics such as delay, area, and power. Examples of such optimizations include among others: peripheral retiming [7], architectural retiming [6], and ite...

متن کامل

Equivalence Checking of Combinational Circuit Using Chaotic Pattern Simulation and Binary Decision Diagrams

With the increase of complexity of circuits, guaranteeing the correctness of design becomes extremely important. A new equivalence checking method is presented in this paper for the verifications of combinational circuits; the method uses the chaotic pattern simulation to find a lot of equivalent nodes, which results in that the scale of the composite circuit is reduced. The equivalence checkin...

متن کامل

Formal Methods for Functional Verification

Formal hardware verification ranges from proving that two combinational circuits compute the same functions to the much more ambitious task of proving that a sequential circuit obeys some abstract property expressed in temporal logic. In tracing the history of work in this area, we find a few efforts in the 1970s and 1980s, with a big increase in verification capabilities the late 1980s up thro...

متن کامل

Tim Pruss , Priyank Kalla , Senior Member , IEEE , and

Abstraction plays an important role in digital design, analysis and verification. This paper introduces a word-level abstraction of the function implemented by a combinational logic circuit. The abstraction provides a canonical representation of the function as a polynomial Z =F (A) over the finite field F2k , where Z,A represent the k-bit word-level output and input of the circuit, respectivel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997